CSI 30: Discrete Mathematics

CSI 30 is an introduction to mathematical methods in computer science. It begins with basic concepts of mathematical logic, continues with an introduction to algorithms and programming, and concludes with an introduction to counting techniques and probability. The syllabus of the class is available here Syllabus. More resources available in the wegpage Math CSI 30.

Lectures:

Lectures 1: Propositional logic.

Lectures 2: Boolean and translation.

Lectures 3: Propositional equivalences.

Lectures 4: Predicates and quantifiers.

Lectures 5: Nested quantifiers.

Lectures 6: Rules of inference.

Lectures 7: Sets.

Lectures 8: Operations with sets.

Lectures 9: One-to-one and onto functions.

Lectures 10: Inverses and compositions.

Lectures 11: Matrix Arithmetic.

Lectures 12: Algorithms and Pseudocode.

Lectures 13: Sorting and Greedy Algorithms.

Lecture 14: The division algorithm.

Lecture 15: Applications of modular congruences.

Lecture 16: The Fundamental Theorem of Arithmetic.

Lecture 17: Representation of integers.

Lecture 18: Basic counting principles.

Lecture 19: Complex counting problems.

Lecture 20: Permutations and Combinations.

Lecture 21: Binomial Coefficients.

Lecture 22: Introduction to Probability.

Midterm Exams Preparation:

Exam 1 Review with solutions.

Exam 1 ExtraCredit.

Take Home Exam:

Exam 3 Due 05/01.

Final Exam Preparation:

Final Exam Preparation.

s